The Boolean functions computed by random Boolean formulas or how to grow the right function
نویسندگان
چکیده
منابع مشابه
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important and challenging problem. In this paper we characterize growth processes by their initial conditions and derive c...
متن کاملProbabilities of Boolean Functions given by Random Implicational Formulas
We study the asymptotic relation between the probability and the complexity of Boolean functions in the implicational fragment which are generated by large random Boolean expressions involving variables and implication, as the number of variables tends to infinity. In contrast to models studied in the literature so far, we consider two expressions to be equal if they differ only in the order of...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملEncoding Nested Boolean Functions as Quantified Boolean Formulas
In this paper, we consider the problem of compactly representing nested instantiations of propositional subformulas with different arguments as quantified Boolean formulas (QBF). We develop a generic QBF encoding pattern which combines and generalizes existing QBF encoding techniques for simpler types of redundancy. We obtain an equivalence-preserving transformation in linear time from the PSPA...
متن کاملThe number of Boolean functions computed by formulas of a given size
Estimates are given of the number B(n; L) of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and ^; _ connectives. (L is the number of occurrences of variables. L ?1 is the number of binary ^'s and _'s. B(n; L) is also the number of functions computed by two terminal series-parallel networks with L switches.) Enroute the read-once ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2005
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20095